Interpolated PLSI for Learning Plausible Verb Arguments

نویسندگان

  • Hiram Calvo
  • Kentaro Inui
  • Yuji Matsumoto
چکیده

Learning Plausible Verb Arguments allows to automatically learn what kind of activities, where and how, are performed by classes of entities from sparse argument co-occurrences with a verb; this information it is useful for sentence reconstruction tasks. Calvo et al. (2009b) propose a non language-dependent model based on the Word Space Model for calculating the plausibility of candidate arguments given one verb and one argument, and compare with the single latent variable PLSI algorithm method, outperforming it. In this work we replicate their experiments with a different corpus, and explore variants to the PLSI method in order to explore further capabilities of this latter widely used technique. Particularly, we propose using an interpolated PLSI scheme that allows the combination of multiple latent semantic variables, and validate it in a task of identifying the real dependency-pair triple with regard to an artificially created one, obtaining up to 83% recall.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Embeddings for Transitive Verb Disambiguation by Implicit Tensor Factorization

We present an implicit tensor factorization method for learning the embeddings of transitive verb phrases. Unlike the implicit matrix factorization methods recently proposed for learning word embeddings, our method directly models the interaction between predicates and their two arguments, and learns verb phrase embeddings. By representing transitive verbs as matrices, our method captures multi...

متن کامل

Note on Algorithm Differences Between Nonnegative Matrix Factorization And Probabilistic Latent Semantic Indexing

NMF and PLSI are two state-of-the-art unsupervised learning models in data mining, and both are widely used in many applications. References have shown the equivalence between NMF and PLSI under some conditions. However, a new issue arises here: why can they result in different solutions since they are equivalent? or in other words, their algorithm differences are not studied intensively yet. I...

متن کامل

Using Visual Information to Predict Lexical Preference

Most NLP systems make predictions based solely on linguistic (textual or spoken) input. We show how to use visual information to make better linguistic predictions. We focus on selectional preference; specifically, determining the plausible noun arguments for particular verb predicates. For each argument noun, we extract visual features from corresponding images on the web. For each verb predic...

متن کامل

Children’s use of argument structure, meta-knowledge of the lexicon, and extra-linguistic contextual cues in inferring meanings of novel verbs

Verbs are the centerpiece of the sentence, and understanding of verb meanings is essential for language acquisition. Yet verb learning is said to be more challenging than noun learning for young children for several reasons. First, while nouns tend to denote concrete objects, which are perceptually stable over time, verbs tend to refer to action events, which are temporally ephemeral, and the b...

متن کامل

How could a child use verb syntax to learn verb semantics ? *

I examine Gleitman’s (1990) arguments that children rely on a verb’s syntactic subcategorization frames to learn its meaning (e.g., they learn that see means ‘perceive visually’ because it can appear with a direct object, a clausal complement, or a directional phrase). First, Gleitman argues that the verbs cannot be learned by observing the situations in which they are used, because many verbs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009